基于依赖矩阵的Web服务组合故障诊断

为了保证指挥信息系统在动态环境下能够提供持续可靠的组合服务,提出一种利用依赖矩阵对Web服务组合故障原因进行诊断的模型,对依赖矩阵的建立进行了详细说明。然后,基于构造的依赖矩阵,提出改进的贪心算法对失效情况进行探测,并设计了基于二分查找的故障定位算法。实验模拟表明,提出的模型能够利用少量探测就能监测整个服务组合流程的运行情况,并定位找到错误源。     

New results on rendezvous search on the interval

In a rendezvous search problem, two players are placed in a network and must try to meet each other in the least possible expected time. We look at rendezvous search on a discrete interval in which the players are initially placed using independent draws (usually assumed to be from the same distribution). Some optimal solutions are known if this distribution is uniform, and also for certain other special types of distribution. In this article, we present two new results. First, we characterize the complete set of solutions for the uniform case, showing that all optimal strategies must have two specific properties (namely, of being swept and strictly geodesic). Second, we relate search strategies on the interval to proper binary trees, and use this correspondence to derive a recurrence relation for solutions to the symmetric rendezvous problem for any initial distribution. This relation allows us to solve any such problem computationally by dynamic programming. Finally, some ideas for future research are discussed. © Wiley Periodicals, Inc. Naval Research Logistics 60: 454–467, 2013     

Asymptotic analysis of periodic policies for the inventory routing problem

In this article, a distribution system is studied where the sum of transportation and inventory costs is to be minimized. The inventory holding cost is assumed to be the same for all retailers. A fixed partition (FP) periodic policy is proposed with tight asymptotic worst‐case performance of 3/2 with respect to the best possible policy. This bound cannot be improved in the class of FP periodic policies. In partition‐based PB policies, the retailers are first partitioned into sets and then the sets are grouped in such a way that sets of retailers within a group are served together at selected times. A PB periodic, policy is presented with tight worst‐case asymptotic performance of with respect to the best possible policy. This latter performance improves the worst‐case asymptotic performance of of the previously best known policy for this problem. We also show that the proposed PB periodic policy has the best worst‐case asymptotic performance within the class of PB policies. Finally, practical heuristics inspired by the analyzed policies are designed and tested. The asymptotic worst–case performances of the heuristics are shown to be the same of those of the analyzed policies. Computational results show that the heuristics suggested are less than 6.4% on average from a lower bound on the optimal cost when 50 or more retailers are involved. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2013     

Multi-scale traffic vehicle detection based on faster R-CNN with NAS optimization and feature enrichment

It well known that vehicle detection is an important component of the field of object detection. However, the environment of vehicle detection is particularly sophisticated in practical processes. It is compara-tively difficult to detect vehicles of various scales in traffic scene images, because the vehicles partially obscured by green belts, roadblocks or other vehicles, as well as influence of some low illumination weather. In this paper, we present a model based on Faster R-CNN with NAS optimization and feature enrichment to realize the effective detection of multi-scale vehicle targets in traffic scenes. First, we proposed a Retinex-based image adaptive correction algorithm (RIAC) to enhance the traffic images in the dataset to reduce the influence of shadow and illumination, and improve the image quality. Second, in order to improve the feature expression of the backbone network, we conducted Neural Architecture Search (NAS) on the backbone network used for feature extraction of Faster R-CNN to generate the optimal cross-layer connection to extract multi-layer features more effectively. Third, we used the object Feature Enrichment that combines the multi-layer feature information and the context information of the last layer after cross-layer connection to enrich the information of vehicle targets, and improve the robustness of the model for challenging targets such as small scale and severe occlusion. In the imple-mentation of the model, K-means clustering algorithm was used to select the suitable anchor size for our dataset to improve the convergence speed of the model. Our model has been trained and tested on the UN-DETRAC dataset, and the obtained results indicate that our method has art-of-state detection performance.     

自航式鱼雷发射装置发射管长度优化研究

基于某型鱼雷自航发射的内弹道数学模型,选择自航管的总长度作为优化目标,讨论了约束函数的取值,确定了优化问题的数学表达.采用惩罚函数法进行寻优计算,针对约束函数具有不可微和非线性的特点,采用模式搜索算法进行了无约束优化的求解,给出了优化结果并进行了比较.     

海洋移动目标多模型运动预测方法

分析海洋移动目标的运动特征,提出了预测前插值的灰色预测方法,改进了航迹变更预测和潜在区域预测模型。通过集成匀速运动预测、航迹变更预测、基于航迹的预测和潜在区域预测,提出多模型运动预测方法及其模型参数配置依据,根据滑动时间窗口中的观测数据与预测值的统计比较,评价不同预测方法的近期预测效果,决策下阶段适宜选择的预测方法。仿真实验表明多模型运动预测比使用单一运动预测方法降低预测风险,提高了预测精度。     

A generalized assignment model for dynamic supply chain capacity planning

We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

面向动作序列的敏捷卫星任务规划问题

针对新一代敏捷卫星对地观测任务规划问题,考虑了直拍直传、立体成像、多条带拼接等复杂任务需求和观测、数据下传、对日定向等九种卫星动作,在任务规划的同时进行卫星动作规划。设计并实现了前瞻启发式构造算法,算法满足卫星存储、能量等复杂约束,在前瞻过程中每次决定当前任务是否安排。采用基于专家知识的多种启发式规则决定任务安排与安排卫星动作序列。仿真实例及实际工程应用表明,算法可以在很短的时间内给出较好的结果,证明了本文方法对于敏捷卫星任务规划问题的适用性。     

驱护舰编队对潜防御性搜索态势分析与方法

针对驱护舰武器装备的发展,结合驱护舰编队海上对潜防御作战的新特点,根据特定驱护舰编队的使命任务,提出了特定驱护舰编队对潜进攻性搜索与防御性搜索的新概念,并在战斗战场范围内对特定驱护舰编队对潜防御性搜索态势进行了分析,给出了编队对潜防御性搜索方法.对部队作战与训练具有一定的参考应用价值.     

Heuristics for the location of inspection stations on a network

This article considers the preventive flow interception problem (FIP) on a network. Given a directed network with known origin‐destination path flows, each generating a certain amount of risk, the preventive FIP consists of optimally locating m facilities on the network in order to maximize the total risk reduction. A greedy search heuristic as well as several variants of an ascent search heuristic and of a tabu search heuristic are presented for the FIP. Computational results indicate that the best versions of the latter heuristics consistently produce optimal or near optimal solutions on test problems. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 287–303, 2000